Higher Spin Alternating Sign Matrices
نویسندگان
چکیده
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or column are nonnegative. Such matrices correspond to configurations of spin r/2 statistical mechanical vertex models with domain-wall boundary conditions. The case r = 1 gives standard alternating sign matrices, while the case in which all matrix entries are nonnegative gives semimagic squares. We show that the higher spin alternating sign matrices of size n are the integer points of the r-th dilate of an integral convex polytope of dimension (n−1)2 whose vertices are the standard alternating sign matrices of size n. It then follows that, for fixed n, these matrices are enumerated by an Ehrhart polynomial in r.
منابع مشابه
Spin Chains in Combinatorics
We give a review of the elementary properties of spin chains together with some applications to the enumeration of alternating sign matrices. The main references concerning spin chains are [1, 2].
متن کاملPattern Avoidance in Alternating Sign Matrices
We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices avoiding 132 is proved to be counted by the large Schröder numbers, 1, 2, 6, 22, 90, 394 . . .. We give a bijection between 132-avoiding alternating sign matrices and Schröder-paths, which gives a refined enumeration. We also show that the 132, 123avoiding alternatin...
متن کاملAffine Alternating Sign Matrices
An Alternating sign matrix is a square matrix of 0’s, 1’s, and −1’s in which the sum of the entries in each row or column is 1 and the signs of the nonzero entries in each row or column alternate. This paper attempts to define an analogue to alternating sign matrices which is infinite and periodic. After showing the analogue we define shares desirable cahracteristics with alternating sign matri...
متن کاملSymmetric alternating sign matrices
In this note we consider completions of n×n symmetric (0,−1)-matrices to symmetric alternating sign matrices by replacing certain 0s with +1s. In particular, we prove that any n×n symmetric (0,−1)-matrix that can be completed to an alternating sign matrix by replacing some 0s with +1s can be completed to a symmetric alternating sign matrix. Similarly, any n × n symmetric (0,+1)-matrix that can ...
متن کاملA refined Razumov-Stroganov conjecture
We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign matrices, i.e. with prescribed configuration of their first row, as well as to refined fully-packed loop configurations on a square grid, keeping track both of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007